The Chip Firing Game and Matroid Complexes

نویسنده

  • Criel Merino
چکیده

In this paper we construct from a cographic matroid M , a pure multicomplex whose degree sequence is the h–vector of the the matroid complex of M. This result proves a conjecture of Richard Stanley [Sta96] in the particular case of cographic matroids. We also prove that the multicomplexes constructed are M–shellable, so proving a conjecture of Manoj Chari [Cha97] again in the case of cographic matroids. The proofs use results on a game for graphs called the chip firing game.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classes of lattices induced by chip firing (and sandpile) dynamics

In this paper we study three classes of models widely used in physics, computer science and social science: the Chip Firing Game, the Abelian Sandpile Model and the Chip Firing Game on a mutating graph. We study the set of configurations reachable from a given initial configuration, called the configuration space of a model, and try to determine the main properties of such sets. We study the or...

متن کامل

Dummy Fill as a Reduction to Chip-Firing

A vertex that is ready may be fired by sending one chip along each edge, and two chips along each loop. We can visualize the firing two chips through a loop by imagining one chip sent on either connection of the loop to the vertex, so that the two chips pass each other within the loop. The game begins by specifying an initial configuration c0 and repeatedly firing vertices that are ready. The g...

متن کامل

A Variation on Chip-Firing: the diffusion game

We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. Although the parallel chip-firing game is inherently periodic as the dynamics occur on a finite set, the diffusion game is not obviously periodic: even if 2|E(...

متن کامل

0 The lattice structure of Chip Firing

In this paper, we study a classical discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of such a system started in any configuration is a lattice, which implies strong structural properties. The lattice structure of the configuration space of a d...

متن کامل

Parallel Chip Firing Game associated with n-cube orientations

We study the cycles generated by the chip firing game associated with n-cube orientations. We show the existence of the cycles generated by parallel evolutions of even lengths from 2 to 2n on Hn (n ≥ 1), and of odd lengths different from 3 and ranging from 1 to 2−1 on Hn (n ≥ 4).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001